#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
typedef long long ll;
const ll MAXN=1e4+7;
ll a[MAXN];
int main() {
	ll n, k;
	cin.sync_with_stdio(false);
	cin>>n>>k;
	for (int i=0; i<n; ++i) {
		cin>>a[i];
	}
	ll tmp=0;
	ll res1,res2;
	bool flag=false;
	for (int i=0; i<n; ++i) {
		tmp=0;
		for (int j=i; j<n; ++j) {
			tmp+=a[j];
			if (tmp==k) {
				res1=i; res2=j; flag=true;
				break;
			}
		}
		if (flag) break;
	}
	if (flag) cout<<res1+1<<" "<<res2+1<<endl;
	else cout<<"No Solution"<<endl;
	return 0;
}
